Vehicle routing on road networks: How good is Euclidean approximation?

On Euclidean Vehicle Routing with Allocation

The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do not lie on the tour are allocated, i.e., they are directly connected to the nearest tour point, paying a higher (per-unit) cost. More formally, the input is a set of points P ⊂ R and functions α : P → [0,∞) and β : P ...

How good is the born-oppenheimer approximation?

Why and How Is Compassion Necessary to Provide Good Healthcare? Comments From an Academic Physician; Comment on “Why and How Is Compassion Necessary to Provide Good Quality Healthcare?”

This is a short commentary to the editorial issued by Marianna Fotaki, entitled: “Why and how is compassion necessary to provide good quality healthcare.” It introduces the necessity of a more cognitive approach to explore further the determinants of behavior towards compassionate care. It raises questions about the importance of training towards a more patient-care and values driven healthcare...

Is OSM Good Enough for Vehicle Routing? A Study Comparing Street Networks in Vienna

As a result of OpenStreetMap’s (OSM) openness and wide availability, there is increasing interest in using OSM street network data in routing applications. But due to the heterogeneous nature of Volunteered Geographic Information (VGI) in general and OSM in particular, there is no universally valid answer to questions about the quality of these data sources. In this paper we address the lack of...

Pricing routines for vehicle routing with time windows on road networks

Several very effective exact algorithms have been developed for vehicle routing problems with time windows. Unfortunately, most of these algorithms cannot be applied to instances that are defined on road networks, because they implicitly assume that the cheapest path between two customers is equal to the quickest path. Garaix and coauthors proposed to tackle this issue by first storing alternat...